Partitioning a graph into alliance free sets
نویسندگان
چکیده
منابع مشابه
Partitioning a graph into alliance free sets
A strong defensive alliance in a graph G = (V, E) is a set of vertices A ⊆ V , for which every vertex v ∈ A has at least as many neighbors in A as in V − A. We call a partition A, B of vertices to be an alliance-free partition, if neither A nor B contains a strong defensive alliance as a subset. We prove that a connected graph G has an alliance-free partition exactly when G has a block that is ...
متن کاملPartitioning a graph into convex sets
Let G be a finite simple graph. Let S ⊆ V (G), its closed interval I[S] is the set of all vertices lying on a shortest path between any pair of vertices of S. The set S is convex if I[S] = S. In this work we define the concept of convex partition of graphs. If there exists a partition of V (G) into p convex sets we say that G is p-convex. We prove that is NP -complete to decide whether a graph ...
متن کاملGraph Partitioning for Independent Sets
Computing maximum independent sets in graphs is an important problem in computer science. In this paper, we develop an evolutionary algorithm to tackle the problem. The core innovations of the algorithm are very natural combine operations based on graph partitioning and local search algorithms. More precisely, we employ a state-of-the-art graph partitioner to derive operations that enable us to...
متن کاملMaximum Alliance-Free and Minimum Alliance-Cover Sets
A defensive k−alliance in a graph G = (V, E) is a set of vertices A ⊆ V such that for every vertex v ∈ A, the number of neighbors v has in A is at least k more than the number of neighbors it has in V −A (where k is the strength of defensive k−alliance). An offensive k−alliance is a set of vertices A ⊆ V such that for every vertex v ∈ ∂A, the number of neighbors v has in A is at least k more th...
متن کاملPartitioning a graph into disjoint cliques and a triangle-free graph
A (P3-free, K3-free)-colouring of a graph G = (V, E) is a partition of V = A ∪ B such that G[A] is P3-free and G[B] is K3-free. This problem is known to be NP-complete even when restricted to planar graphs and perfect graphs. In this paper, we provide a finite list of 17 forbidden induced subgraphs for cographs with a (P3-free, K3-free)colouring. This yields a linear time recognition algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.08.011